A deterministic motif finding algorithm with application to the human genome
نویسندگان
چکیده
منابع مشابه
A deterministic motif finding algorithm with application to the human genome
MOTIVATION We present a novel algorithm, MaMF, for identifying transcription factor (TF) binding site motifs. The method is deterministic and depends on an indexing technique to optimize the search process. On common yeast datasets, MaMF performs competitively with other methods. We also present results on a challenging group of eight sets of human genes known to be responsive to a diverse grou...
متن کاملImprovement of the Projection Motif Finding Algorithm
In 2001 Buhler and Tompa [BT01] introduced their Projection algorithm for solving the motif discovery problem for motifs of fixed length l. The algorithm finds good candidates for local optimisation by projecting all l-mers present in the input onto a smaller subspace and analysing dense points in that subspace. We have developed Aggregation, a modified version of Projection that analyses dense...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولPROJECTION Algorithm for Motif Finding on GPUs
Motif finding is one of the NP-complete problems in Computational Biology. Existing nondeterministic algorithms for motif finding do not guarantee the global optimality of results and are sensitive to initial parameters. To address this problem, the PROJECTION algorithm provides a good initial estimate that can be further refined using local optimization algorithms such as EM, MEME or Gibbs. Fo...
متن کاملOn counting position weight matrix matches in a sequence, with application to discriminative motif finding
MOTIVATION AND RESULTS The position weight matrix (PWM) is a popular method to model transcription factor binding sites. A fundamental problem in cis-regulatory analysis is to "count" the occurrences of a PWM in a DNA sequence. We propose a novel probabilistic score to solve this problem of counting PWM occurrences. The proposed score has two important properties: (1) It gives appropriate weigh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2006
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btl037